翻訳と辞書 |
Minimal recursion semantics : ウィキペディア英語版 | Minimal recursion semantics Minimal recursion semantics (MRS) is a framework for computational semantics. It can be implemented in typed feature structure formalisms such as head-driven phrase structure grammar and lexical functional grammar. It is suitable for computational language parsing and natural language generation.〔Copestake, A., Flickinger, D. P., Sag, I. A., & Pollard, C. (2005). (Minimal Recursion Semantics. An introduction ). In Research on Language and Computation. 3:281–332〕 MRS enables a simple formulation of the grammatical constraints on lexical and phrasal semantics, including the principles of semantic composition. This technique is used in machine translation. Early pioneers of MRS include Ann Copestake, Dan Flickinger, Carl Pollard, and Ivan Sag.〔 ==See also==
* Computational semantics * DELPH-IN
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Minimal recursion semantics」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|